import java.util.*;
import java.util.Map;
import java.util.HashMap;
import java.util.Scanner;

public class Solution {
    public int[] twoSum(int[] nums, int target) {
        // 请在此处实现你的算法
        return new int[0];
    }

public static void main(String[] args) {
    if (args.length >= 2) {
        // 解析数组输入
        String arrayStr = args[0].trim();
        if (arrayStr.startsWith("[") && arrayStr.endsWith("]")) {
            arrayStr = arrayStr.substring(1, arrayStr.length() - 1);
        }
        String[] parts = arrayStr.split(",");
        int[] nums = new int[parts.length];
        for (int i = 0; i < parts.length; i++) {
            nums[i] = Integer.parseInt(parts[i].trim());
        }
        
        int target = Integer.parseInt(args[1].trim());
        
        Solution solution = new Solution();
        int[] result = solution.twoSum(nums, target);
        System.out.println(Arrays.toString(result));
    }
}
}